منابع مشابه
Lecture Notes on Invariants for While Loops and Arbitrary Loops
The previous lecture provided axioms for compositional reasoning about deterministic sequential programs. All the axioms compositionally reduce the truth of a postcondition of a more complex program to a logical combination of postconditions of simpler programs. All axioms? Well, all the axioms but one: those about loops. But putting loops aside for the moment, these axioms completely tell us w...
متن کاملParallelizing While Loops for Multiprocessor Systemsy
Current parallelizing compilers treat while loops and do loops with conditional exits as sequential constructs because their iteration space is unknown. Motivated by the fact that these types of loops arise frequently in practice, we have developed techniques that can be used to automatically transform them for parallel execution. We succeed in parallelizing loops involving linked lists travers...
متن کاملParallelizing while loops for multiprocessor systems
Current parallelizing compilers treat WHILE loops and DO loops with conditional exits as sequential constructs because their iteration space is unknown. Motivated by the fact that these types of loops arise frequently in practice, we have developed techniques that can be used to automatically transform them for parallel execution. We succeed in parallelizing loops involving linked lists travers...
متن کاملLocal Reasoning about While-Loops
Separation logic is an extension of Hoare logic that allows local reasoning. Local reasoning is a powerful feature that often allows simpler specifications and proofs. However, this power is not used to reason about while-loops. In this paper an inference rule is presented that allows using local reasoning to verify the partial correctness of while-loops. Instead of loop invariants this inferen...
متن کاملLearning Admissible Heuristics while Solving Problems
A method is presented that causes A* to return high quality solutions whi le solving a set of problems using a non-admissible heuristic. The heuristic gu id ing the search changes as new informat ion is learned dur ing the search, and it converges to an admissible heuristic wh ich 'contains the insight ' of the or ig ina l nonadmissible one. After a finite number of problems, A * returns only o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1992
ISSN: 0167-6423
DOI: 10.1016/0167-6423(92)90034-9